Syntactic recursion and iteration
نویسنده
چکیده
The nature and origin of syntactic recursion in natural languages is a topical problem. Important recent contributions include those of Johansson (2005), Parker (2006), Tomalin (2006; 2007), and Heine and Kuteva (2007). Syntactic recursion will here be discussed especially in relation to its cognate concept of iteration. Their basic common feature is plain structural repetition: “keep on emitting instances of the current structure, or stop”. Their main difference is that recursion builds structure by increasing embedding depth whereas iteration yields flat output structures which do not increase depth. My focus here is on the types of recursion and iteration, and on what empirically determinable constraints there are on the number of recursive and iterative cycles of application. Recursion comes in two subtypes, nested recursion (= center-embedding) and tail-recursion, the latter covering left-recursion and right-recursion. There are six functionally different types of iteration: structural iteration, apposition, reduplication, repetition, listing and succession. It will be empirically shown that multiple nested syntactic recursion of degrees greater than 3 does not exist in written language, neither in sentences nor in noun phrases or prepositional phrases. In practice, even nesting of degree 2 is extremely rare in writing. In speech, nested recursion at depths greater than 1 is practically non-existing, thus partly confirming an early hypothesis of Reich (1969). Left-branching tail-recursion of clauses is strictly constrained to maximally two recursive cycles. Right-branching clausal tail-recursion rarely transcends three cycles in spoken language and five in written language. On constituent level both leftand right-branching is less constrained (especially in written language), but e.g. left-branching genitives rarely recurse more than two cycles ([[[Pam’s] mum’s] baggage]).
منابع مشابه
A stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملInductive and Coinductive types with Iteration and Recursion in a Polymorphic Framework
We study (extensions of) polymorphic typed lambda calculus from a point of view of how iterative and recursive functions on inductive types are represented. The inductive types can usually be understood as initial algebras in a certain category and then recursion can be defined in terms of iteration. However, in the syntax we often have only weak initiality, which makes the definition of recurs...
متن کاملSpace Usage in Functional Query Languages
We consider evaluation strategies for database queries expressed in three functional query languages: the complex value algebra, the simply typed lambda calculus, and method schemas. Each of these query languages derives its expressive power from a diierent primitive: the complex value algebra from the powerset operator, the simply typed lambda calculus from list iteration, and method schemas f...
متن کاملSyntactic Control of Concurrency
We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained with minimum loss of expressivity. To that end we define an annotated type system that controls the...
متن کاملRecursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent variable binding or to maintain certain invariants through typing. In dependent type theory, a major concern is the termination of all expressible programs, so that types that depend on object terms can still be type...
متن کامل